The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon
نویسندگان
چکیده
We present a diagram that captures containment information for scalable translations of a convex polygon. For a given polygon P and contact point q in a set S, the diagram parameterizes possible translations and scales of the polygon in order to represent containment regions for each other point v in S. We present geometric and combinatorial properties for this diagram, and describe how it can be computed and used in the solution of several geometric problems.
منابع مشابه
The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon
We present a diagram that captures containment information for scalable rotated and translated versions of a convex polygon. For a given polygon P and a contact point q in a point set S, the diagram parameterizes possible translations, rotations, and scales of the polygon in order to represent containment regions for each additional point v in S. We present geometric and combinatorial propertie...
متن کاملVoronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملCaging Polygons with Two and Three Fingers
We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible to take the polygon to infinity without penetrating one of the fingers. Using a classification into squeezing and stretching cagings, we provide an algorithm that reports all caging placements of two disc fingers in O(...
متن کاملVoronoi Diagrams for Convex Polygon-Offset Distance Functions
In this paper we develop the concept of a convex polygon-offset distance function. Using offset as a notion of distance, we show how to compute the corresponding nearestand furthest-site Voronoi diagrams of point sites in the plane. We provide nearoptimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000